Constructing an Infinite Family of Cubic 1-Regular Graphs
نویسندگان
چکیده
A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163–182] constructed an infinite family of cubic 1-regular graphs of order 2p, where p ≥ 13 is a prime congruent to 1 modulo 3. Marušič and Xu [J. Graph Theory, 25 (1997), 133– 138] found a relation between cubic 1-regular graphs and tetravalent half-transitive graphs with girth 3 and Alspach et al. [J. Aust. Math. Soc. A, 56 (1994), 391–402] constructed infinitely many tetravalent half-transitive graphs with girth 3. Using these results, Miller’s construction can be generalized to an infinite family of cubic 1-regular graphs of order 2n, where n ≥ 13 is odd such that 3 divides φ(n), the Euler function of n. In this paper, we construct an infinite family of cubic 1-regular graphs with order 8(k2 + k + 1)(k ≥ 2) as cyclic-coverings of the three-dimensional Hypercube.
منابع مشابه
A note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملClassifying cubic symmetric graphs of order 8p or 8p2
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, we classify the s-regular elementary Abelian coverings of the three-dimensional hypercube for each s ≥ 1 whose fibre-preserving automorphism subgroups act arc-transitively. This gives a new infinite family of cubic 1-regular graphs, in which the smallest one has order 19 208. As an application...
متن کاملCONSTRUCTING INFINITE ONE - REGULAR GRAPHSAleksander
Austria Abstract A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an innnite family of innnite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.
متن کاملCubic symmetric graphs of order a small number times a prime or a prime square
A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular elementary abelian coverings of the complete bipartite graph K3,3 and the s-regular cyclic or elementary abelian coverings of the complete graph K4 for each s 1 are classified when the fibrepreserving automorphism groups act arc-transitively. A new infinite family of cubic 1-regu...
متن کاملConstructing one-regular graphs of valency 4k with non-cyclic vertex stabilizer
A graph is said to be one-regular if its automorphism group acts transitively and freely on the arc set. In this paper, an infinite family of one-regular graphs of valency 4k with non-cyclic vertex stabilizer is constructed. © 2006 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2002